Forward Analysis of Updatable Timed Automata

P . Bouyer Updatable Timed Automata , an Algorithmic Approach

The notion of updatable timed automata has been introduced as a natural syntactic extension of classical timed automata. These updatable timed automata allow in particular to represent large classes of real-time systems in a much more concise way. For numerous families of updatable timed automata, the decidability of the emptiness problem has been proved with a suitable extension of Alur and Di...

Updatable timed automata

We investigate extensions of Alur and Dill’s timed automata, based on the possibility to update the clocks in a more elaborate way than simply reset them to zero. We call these automata updatable timed automata. They form an undecidable class of models, in the sense that emptiness checking is not decidable. However, using an extension of the region graph construction, we exhibit interesting dec...

Patricia Bouyer Timed Automata May Cause Some Troubles

Timed automata are a widely studied model. Its decidability has been proved using the so-called region automaton construction. This construction provides a correct abstraction for the behaviours of timed automata, but it does not support a natural implementation and, in practice, algorithms based on the notion of zones are implemented using adapted data structures like DBMs. When we focus on fo...

On Termination and Boundedness of Nested Updatable Timed Automata

We introduce a model named nested updatable timed automata (NeUTAs), which can be regarded as a combination of nested timed automata (NeTAs) and updatable timed automata with one updatable clock (UTA1s). The model is suitable for soft real-time system analysis, since the updatable clock representing a deadline can be updated due to environments. A NeUTA behaves as a UTA1, in which all clocks ca...

P . Bouyer A New Algorithm to Decide Emptiness of Updatable Timed Automata Research